Privacy-preserving weighted Slope One predictor for Item-based Collaborative Filtering

نویسندگان

  • Anirban Basu
  • Hiroaki Kikuchi
  • Jaideep Vaidya
چکیده

Rating-based collaborative filtering (CF) predicts the rating that a user will give to an item, derived from the ratings of other items given by other users. Such CF schemes utilise either user neighbourhoods (i.e. user-based CF) or item neighbourhoods (i.e. item-based CF). Lemire and MacLachlan [1] proposed three related schemes for an item-based CF with predictors of the form f(x) = x+b, hence the name “slope one”. Slope One predictors have been shown to be accurate on large datasets. They also have several other desirable properties such as being updatable on the fly, efficient to compute, and work even with sparse input. In this paper, we present a privacy-preserving item-based CF scheme through the use of an additively homomorphic public-key cryptosystem on the weighted Slope One predictor; and show its applicability on both horizontal and vertical partitions. We present an evaluation of our proposed scheme in terms of communication and computation complexity.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient Privacy-Preserving Collaborative Filtering Based on the Weighted Slope One Predictor

Rating-based collaborative filtering (CF) predicts the rating that a user will give to an item, derived from the ratings of other items given by other users. Such CF schemes utilise either user neighbourhoods (i.e. user-based CF) or item neighbourhoods (i.e. item-based CF). Lemire and MacLachlan [19] proposed three related schemes for an item-based CF with predictors of the form f (x) = x+b, he...

متن کامل

Perturbation Based Privacy Preserving Slope One Predictors for Collaborative Filtering

The prediction of the rating that a user is likely to give to an item, can be derived from the ratings of other items given by other users, through collaborative filtering (CF). However, CF raises concerns about the privacy of the individual user’s rating data. To deal with this, several privacy-preserving CF schemes have been proposed. However, they are all limited either in terms of efficienc...

متن کامل

An algorithm for efficient privacy-preserving item-based collaborative filtering

Collaborative filtering (CF) methods are widely adopted by existing recommender systems, which can analyze and predict user ‘‘ratings’’ or ‘‘preferences’’ of newly generated items based on user historical behaviors. However, privacy issue arises in this process as sensitive user private data are collected by the recommender server. Recently proposed privacy-preserving collaborative filtering (P...

متن کامل

A New Similarity Measure Based on Item Proximity and Closeness for Collaborative Filtering Recommendation

Recommender systems utilize information retrieval and machine learning techniques for filtering information and can predict whether a user would like an unseen item. User similarity measurement plays an important role in collaborative filtering based recommender systems. In order to improve accuracy of traditional user based collaborative filtering techniques under new user cold-start problem a...

متن کامل

Incorporating Personalized Contextual Information in Item-based Collaborative Filtering Recommendation

After reviewing the prior work and problem of collaborative filtering recommendation approaches, an approach incorporating personalized contextual information in item-based collaborative filtering is proposed to solve the problem. The approach provides recommendations based on user personalized contextual information besides the typical information on users and items used in most of the current...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011